CONSTRAINT PROGRAMMING AND UNIVERSITY TIMETABLING
نویسندگان
چکیده
منابع مشابه
University Timetabling Using Constraint Logic Programming
A timetable is a temporal arrangement of a set of meetings such that all given constraints are satissed. A timetabling problem can be suitably modelled in terms of a set of constraints. We use Constraint Logic Programming and develop methods, techniques and concepts for a combination of interactive and automatic timetabling of university courses and school curricula. An exemplary application of...
متن کاملCombining Constraint Programming and Simulated Annealing on University Exam Timetabling
—In this paper, we present a solution method for examination timetabling, consisting of two phases: a constraint programming phase to provide an initial solution and a simulated annealing phase with Kempe chain neighborhood. The second phase is equipped with some refined mechanisms that help to determine crucial cooling schedule parameters. We perform preliminary experiments of the algorithm on...
متن کاملTimetabling in Constraint Logic Programming
Generating timetables is a cumbersome and time consuming task, but programs developed to solve them are usually meant for a particular organisation and can not be easily adapted. Constraint Logic Programming, the result of generalizing Logic Programming uniication to constraint solving over a computation domain, aim at expressing constrained decision problems declaratively, and still solve them...
متن کاملUniversity timetabling using constraint handling rules
E-mail : fabdennad,[email protected] Abstract : Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints however may be violated, but should be satisfied as much as possible. This paper shows how to model our timetab...
متن کاملUniversity Course Timetabling Using Constraint Handling Rules
Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. This paper shows how to model our timetabling problem as a partial constraint satisfaction problem and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The South African Journal of Industrial Engineering
سال: 2012
ISSN: 2224-7890,1012-277X
DOI: 10.7166/13-1-314